package leetcode_401_500;

public class LeeCode_476 {
    public static void main(String[] args) {

    }
    private static int findComplement(int num) {
        int tmp = num, c = 0;
        while (tmp > 0){
            tmp >>= 1;
            c <<= 1;
            c++;
        }
        return num ^ c;
    }
}
